Perfectly Secure Message Transmission Against Rational Adversaries

Secure Message Transmission (SMT) is a two-party cryptographic protocol by which the sender can securely and reliably transmit messages to receiver using multiple channels. An adversary corrupt subset of channels commit eavesdropping tampering attacks over In this work, we introduce game-theoretic security model for SMT in adversaries have some preferences execution. We define rational “timid” who prefer violate requirements but do not be detected. First, consider basic setting where single protocol. construct perfect protocols against any corrupting all one Since minority corruption required traditional setting, our results demonstrate way circumventing impossibility approach. Next, study corrupted cooperate. cannot hope if corrupts or cooperate maliciously, scenario arise from model. also both malicious exist.